Interpolatory Subdivision Curves with Local Shape Control
نویسندگان
چکیده
In this paper we present a novel subdivision scheme that can produce a nice-looking interpolation of the control points of the initial polyline, giving the possibility of adjusting the local shape of the limit curve by choosing a set of tension parameters associated with the polyline edges. If compared with the other existing methods, the proposed model is the only one that allows to exactly reproduce conic section arcs of arbitrary length, create a variety of shape effects like bumps and flat edges, and mix them in the same curve in an unrestricted way. While this is impossible using existing 4-point interpolatory schemes, it can be easily done here, since the proposed subdivision scheme is non-stationary and non-uniform at the same time.
منابع مشابه
A Controllable Ternary Interpolatory Subdivision Scheme
A non-uniform 3-point ternary interpolatory subdivision scheme with variable subdivision weights is introduced. Its support is computed. The C and C convergence analysis are presented. To elevate its controllability, a modified edition is proposed. For every initial control point on the initial control polygon a shape weight is introduced. These weights can be used to control the shape of the c...
متن کاملC1 Interpolatory Subdivision with Shape Constraints for Curves
We derive two reformulations of the C1 Hermite subdivision scheme introduced in [12]. One where we separate computation of values and derivatives and one based of refinement of a control polygon. We show that the latter leads to a subdivision matrix which is totally positive. Based on this we give algorithms for constructing subdivision curves that preserve positivity, monotonicity, and convexi...
متن کاملInterpolatory Subdivision with Shape Constraints for Curves ∗
We derive two reformulations of the C1 Hermite subdivision scheme introduced by Merrien. One where we separate computation of values and derivatives and one based of refinement of a control polygon. We show that the latter leads to a subdivision matrix which is totally positive. Based on this we give algorithms for constructing subdivision curves that preserve positivity, monotonicity, and conv...
متن کاملdi Milano – Bicocca Quaderni di Matematica Convexity preserving interpolatory subdivision with conic precision
The paper is concerned with the problem of shape preserving interpolatory subdivision. For arbitrarily spaced, planar input data an efficient non-linear subdivision algorithm is presented that results in G limit curves, reproduces conic sections and respects the convexity properties of the initial data. Significant numerical examples illustrate the effectiveness of the proposed method.
متن کاملPolynomial-based non-uniform interpolatory subdivision with features control
Starting from a well-known construction of polynomial-based interpolatory 4-point schemes, in this paper we present an original affine combination of quadratic polynomial samples that leads to a non-uniform 4-point scheme with edge parameters. This blending-type formulation is then further generalized to provide a powerful subdivision algorithm that combines the fairing curve of a non-uniform r...
متن کامل